Associative Grammar Combination Operators for Tree-Based Grammars
Identifieur interne : 003A01 ( Main/Exploration ); précédent : 003A00; suivant : 003A02Associative Grammar Combination Operators for Tree-Based Grammars
Auteurs : Yael Sygal [Israël] ; Shuly Wintner [Israël]Source :
- Journal of Logic, Language and Information [ 0925-8531 ] ; 2009-07-01.
English descriptors
Abstract
Abstract: Polarized unification grammar (PUG) is a linguistic formalism which uses polarities to better control the way grammar fragments interact. The grammar combination operation of PUG was conjectured to be associative. We show that PUG grammar combination is not associative, and even attaching polarities to objects does not make it order-independent. Moreover, we prove that no non-trivial polarity system exists for which grammar combination is associative. We then redefine the grammar combination operator, moving to the powerset domain, in a way that guarantees associativity. The method we propose is general and is applicable to a variety of tree-based grammar formalisms.
Url:
DOI: 10.1007/s10849-009-9081-1
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 003971
- to stream Istex, to step Curation: 003927
- to stream Istex, to step Checkpoint: 000B08
- to stream Main, to step Merge: 003A79
- to stream Main, to step Curation: 003A01
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Associative Grammar Combination Operators for Tree-Based Grammars</title><author><name sortKey="Sygal, Yael" sort="Sygal, Yael" uniqKey="Sygal Y" first="Yael" last="Sygal">Yael Sygal</name></author><author><name sortKey="Wintner, Shuly" sort="Wintner, Shuly" uniqKey="Wintner S" first="Shuly" last="Wintner">Shuly Wintner</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:F0C9D8F37F5023502930C03C41361954FAC0CD75</idno><date when="2009" year="2009">2009</date><idno type="doi">10.1007/s10849-009-9081-1</idno><idno type="url">https://api.istex.fr/ark:/67375/VQC-4T11VGL9-W/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">003971</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003971</idno><idno type="wicri:Area/Istex/Curation">003927</idno><idno type="wicri:Area/Istex/Checkpoint">000B08</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000B08</idno><idno type="wicri:doubleKey">0925-8531:2009:Sygal Y:associative:grammar:combination</idno><idno type="wicri:Area/Main/Merge">003A79</idno><idno type="wicri:Area/Main/Curation">003A01</idno><idno type="wicri:Area/Main/Exploration">003A01</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Associative Grammar Combination Operators for Tree-Based Grammars</title><author><name sortKey="Sygal, Yael" sort="Sygal, Yael" uniqKey="Sygal Y" first="Yael" last="Sygal">Yael Sygal</name><affiliation wicri:level="1"><country xml:lang="fr">Israël</country><wicri:regionArea>Department of Computer Science, University of Haifa, Haifa</wicri:regionArea><wicri:noRegion>Haifa</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Israël</country></affiliation></author><author><name sortKey="Wintner, Shuly" sort="Wintner, Shuly" uniqKey="Wintner S" first="Shuly" last="Wintner">Shuly Wintner</name><affiliation wicri:level="1"><country xml:lang="fr">Israël</country><wicri:regionArea>Department of Computer Science, University of Haifa, Haifa</wicri:regionArea><wicri:noRegion>Haifa</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Israël</country></affiliation></author></analytic><monogr></monogr><series><title level="j">Journal of Logic, Language and Information</title><title level="j" type="abbrev">J of Log Lang and Inf</title><idno type="ISSN">0925-8531</idno><idno type="eISSN">1572-9583</idno><imprint><publisher>Springer Netherlands</publisher><pubPlace>Dordrecht</pubPlace><date type="published" when="2009-07-01">2009-07-01</date><biblScope unit="volume">18</biblScope><biblScope unit="issue">3</biblScope><biblScope unit="page" from="293">293</biblScope><biblScope unit="page" to="316">316</biblScope></imprint><idno type="ISSN">0925-8531</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0925-8531</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Grammar combination</term><term>Grammatical formalisms</term><term>Modularity</term><term>Polarized unification grammar</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Polarized unification grammar (PUG) is a linguistic formalism which uses polarities to better control the way grammar fragments interact. The grammar combination operation of PUG was conjectured to be associative. We show that PUG grammar combination is not associative, and even attaching polarities to objects does not make it order-independent. Moreover, we prove that no non-trivial polarity system exists for which grammar combination is associative. We then redefine the grammar combination operator, moving to the powerset domain, in a way that guarantees associativity. The method we propose is general and is applicable to a variety of tree-based grammar formalisms.</div></front></TEI><affiliations><list><country><li>Israël</li></country></list><tree><country name="Israël"><noRegion><name sortKey="Sygal, Yael" sort="Sygal, Yael" uniqKey="Sygal Y" first="Yael" last="Sygal">Yael Sygal</name></noRegion><name sortKey="Sygal, Yael" sort="Sygal, Yael" uniqKey="Sygal Y" first="Yael" last="Sygal">Yael Sygal</name><name sortKey="Wintner, Shuly" sort="Wintner, Shuly" uniqKey="Wintner S" first="Shuly" last="Wintner">Shuly Wintner</name><name sortKey="Wintner, Shuly" sort="Wintner, Shuly" uniqKey="Wintner S" first="Shuly" last="Wintner">Shuly Wintner</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003A01 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 003A01 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:F0C9D8F37F5023502930C03C41361954FAC0CD75
|texte= Associative Grammar Combination Operators for Tree-Based Grammars
}}
| This area was generated with Dilib version V0.6.33. |  |